Practical Preimages for Maraca
نویسندگان
چکیده
The cryptographic hash function Maraca was submitted to the NIST SHA-3 competition [4] by Jenkins [3]. In this work, we show a practical preimage attack on Maraca. Our attack has been implemented and verified experimentally. This shows that Maraca does not achieve several important security properties which a secure cryptographic hash function is expected to offer.
منابع مشابه
Bumba, a replacement name for Maraca Pérez-Miles, 2005 and Bumba lennoni, a new tarantula species from western Amazonia (Araneae, Theraphosidae, Theraphosinae)
We propose the name Bumba as a new name for Maraca, preoccupied by Maraca Hebard, 1926 (Orthoptera). We describe and illustrate Bumbalennoni, a new theraphosid species from Caxiuanã, Pará, Brazil. This species differs from the other species of the genus in the extremely reduced keel on male palpal organ and in the higher number of labial and maxillary cuspules. Females additionally differ in th...
متن کاملAdvanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
We revisit narrow-pipe designs that are in practical use, and their security against preimage attacks. Our results are the best known preimage attacks on Tiger, MD4, and reduced SHA-2, with the result on Tiger being the first cryptanalytic shortcut attack on the full hash function. Our attacks runs in time 2 for finding preimages, and 2 for second-preimages. Both have memory requirement of orde...
متن کاملThe Maraca – a tool for minimizing resource conflicts in a non-periodic railway timetable
While mathematical optimization and operations research receive growing attention in the railway sector, computerized timetabling tools that actually make significant use of optimization remain relatively rare. SICS has developed a prototype tool for non-periodic timetabling that minimizes resource conflicts, enabling the user to focus on the strategic decisions. The prototype is called the Mar...
متن کاملComputation of Explicit Preimages in One-Dimensional Cellular Automata Applying the De Bruijn Diagram
This paper shows how to simplify the calculation of preimages in cellular automata. The method is based on the so called De Bruijn diagrams and work for any k-states and r-radius in one dimensional space. In order to calculate preimages, we construct preimage matrices from the De Bruijn diagram and an operator defined on these matrices. In this way the problem of calculating preimages is reduce...
متن کاملSecond Preimages for Iterated Hash Functions and Their Implications on MACs
In this article, we focus on second preimages for iterated hash functions. More precisely, we introduce the notion of a b-block bypass which is closely related to the notion of second preimage but specifies additional properties. We will then give two examples of iterated hash functions to which this notion applies: a double-block length hash function and a single-block length hash function. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009